Tree Adjoining Grammars: Formal Theory and Applications
نویسندگان
چکیده
منابع مشابه
From Constraints to TAGs: A Transformation from Constraints into Formal Grammars
We present an approach specifying constraints on labeled trees, such as are commonly used within (computational) linguistic theories, and show how to translate these constraints to formal grammars, in particular context-free grammars and (lexicalized) tree adjoining grammars. Our method offers the formal advantages of constraint-based formalisms and at the same time operational efficiency for t...
متن کاملTree-adjoining Grammars for Optimality Theory Syntax
This paper explores an optimality-theoretic approach to syntax based on Tree-Adjoining Grammars (TAG), where two separate optimizations are responsible for the construction of local pieces of tree structure (elementary trees) and the combination of these pieces of structure. The local optimization takes a non-recursive predicate-argument structure (PA-chunk) as an underlying representation and ...
متن کاملWeighted parsing of trees
We show how parsing of trees can be formalized in terms of the intersection of two tree languages. The focus is on weighted regular tree grammars and weighted tree adjoining grammars. Potential applications are discussed, such as parameter estimation across formalisms.
متن کاملMulti-Component Tree Insertion Grammars
In this paper we introduce a new mildly context sensitive formalism called Multi-Component Tree Insertion Grammar. This formalism is a generalization of Tree Insertion Grammars in the same sense that Multi-Component Tree Adjoining Grammars is a generalization of Tree Adjoining Grammars. We show that this class of grammatical formalisms is equivalent to Multi-Component Tree Adjoining Grammars, a...
متن کاملPreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars
Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...
متن کامل